Fair termination revisited-with delayAPT, K. R; PNUELI, A; STAVI, J et al.Theoretical computer science. 1984, Vol 33, Num 1, pp 65-84, issn 0304-3975Article

Two most nondeterministic programsWILTINK, J. G; REM, M.Science of computer programming. 1986, Vol 6, Num 1, pp 89-94, issn 0167-6423Article

Systèmes PARallèles Communicants. Etude du non-déterminisme : comparaison des comportements des processus = Parallel communicating systems. Study of non-determinary: comparison of processes behaviorsROGE, Sylvie.Rapport de recherche - Informatique et mathématiques appliquées de Grenoble, ISSN: 0750-7380 ; 541. 1985, 76 p.Report

Non deterministic machines and their generalizationsBERTONI, A; MAURI, G; SABADINI, N et al.Lecture notes in physics. 1983, Num 196, pp 86-97, issn 0075-8450Article

Langages persistants = Persistent languagesALAIWAN, H.R.A.I.R.O. Informatique théorique. 1984, Vol 18, Num 3, pp 259-278, issn 0399-0540Article

On varieties of density and crossing properties for event structuresKOSTOV, V. E; STARKOVA, S. A; VIRBITSKAITE, I. B et al.Computers and artificial intelligence. 1995, Vol 14, Num 6, pp 611-622, issn 0232-0274Article

Unwinding possibilistic security propertiesMANTEL, Heiko.Lecture notes in computer science. 2000, pp 238-254, issn 0302-9743, isbn 3-540-41031-7Conference Paper

On the semantics of concurrency : partial orders and transition systemsBOUDOL, Gérard; CASTELLANI, Ilaria.Rapport de recherche I.N.R.I.A, ISSN: 0249-6399 ; 550. 1986, 17 p.Report

Canonical prefixes of Petri net unfoldingsKHOMENKO, Victor; KOUTNY, Maciej; VOGLER, Walter et al.Lecture notes in computer science. 2002, pp 582-595, issn 0302-9743, isbn 3-540-43997-8, 14 p.Conference Paper

Choice construct and lindström logicsHOANG, H. K.Lecture notes in computer science. 1999, pp 105-125, issn 0302-9743, isbn 3-540-65922-6Conference Paper

Some observations on the connection between counting and recursionWAGNER, K. W.Theoretical computer science. 1986, Vol 47, Num 2, pp 131-147, issn 0304-3975Article

An algorithm for ensuring fairness and liveness in non-deterministic systems based on multiparty interactionsRUIZ, David; CORCHUELO, Rafael; PEREZ, José A et al.Lecture notes in computer science. 2002, pp 563-572, issn 0302-9743, isbn 3-540-44049-6, 10 p.Conference Paper

On the structure of one-tape nondeterministic turing machine time hierarchyKOBAYASHI, K.Theoretical computer science. 1985, Vol 40, Num 2-3, pp 175-193, issn 0304-3975Article

A callgraph-based search strategy for automated Performance diagnosis¹CAIN, H. W; MILLER, B. P; WYLIE, B. J. N et al.Lecture notes in computer science. 2000, pp 108-122, issn 0302-9743, isbn 3-540-67956-1Conference Paper

Two implementation relations and the correctness of communicating replicated processesKOUTNY, M; MANCINI, L. V; PAPPALARDO, G et al.Formal aspects of computing. 1997, Vol 9, Num 2, pp 119-148, issn 0934-5043Article

Nondeterministic polling systemsSRINIVASAN, M. M.Management science. 1991, Vol 37, Num 6, pp 667-681, issn 0025-1909Article

From Lifting to System TransformationOHTA, Yoshito.Perspectives in Mathematical System Theory, Control, and Signal Processing (A Festschrift in Honor of Yutaka Yamamoto on the Occasion of His 60th Birthday). Lecture notes in control and information sciences. 2010, Vol 398, pp 207-216, issn 0170-8643, isbn 978-3-540-93917-7 3-540-93917-2, 1Vol, 10 p.Book Chapter

Reuse of SMI 2.0 scripts in dividable dynamic timeline-based authoringYANG, Chun-Chuan; WANG, Yung-Chi; CHU, Chen-Kuei et al.IEEE International Conference on multimedia. 2004, isbn 0-7803-8603-5, 3Vol, vol2, 1235-1238Conference Paper

SLAP'02 : synchronous languages, applications, and programming (Grenoble, 13 April 2002)Maraninchi, Florence; Girault, Alain; Rutten, Eric et al.ETAPS 2002 : European joint conference on theory and practice of software. Satellite workshopInternational workshop on synchronous languages, applications, and programming. 2002, 200 p.Conference Proceedings

Introduction to the theory of complexity and approximation algorithmsJANSEN, T.Lecture notes in computer science. 1998, pp 5-28, issn 0302-9743, isbn 3-540-64201-3Conference Paper

Representing Place/Transition nets in Span(Graph)KATIS, P; SABADINI, N; WALTERS, R. F. C et al.Lecture notes in computer science. 1997, pp 322-336, issn 0302-9743, isbn 3-540-63888-1Conference Paper

Reversible simulation of space-bounded computationsCRESCENZI, P; PAPADIMITRIOU, C. H.Theoretical computer science. 1995, Vol 143, Num 1, pp 159-165, issn 0304-3975Article

Turing machines with few accepting computations and low sets for PPKÖBLER, J; SCHÖNING, U; TODA, S et al.Journal of computer and system sciences (Print). 1992, Vol 44, Num 2, pp 272-286, issn 0022-0000Article

A family of algorithms for non deterministic regular languages inferenceDE PARGA, Manuel Vazquez; GARCIA, Pedro; RUIZ, José et al.Lecture notes in computer science. 2006, pp 265-274, issn 0302-9743, isbn 3-540-37213-X, 1Vol, 10 p.Conference Paper

MPL : Efficient record/replay of nondeterministic features of message passing librariesCHASSIN DE KERGOMMEAUX, J; RONSSE, M; DE BOSSCHERE, K et al.Lecture notes in computer science. 1999, pp 141-148, issn 0302-9743, isbn 3-540-66549-8Conference Paper